Constrained k Nearest Neighbor Query for Uncertain Object in the Network
نویسنده
چکیده
Constrained k nearest neighbor query for uncertain object in the network is to find k uncertain objects which are the k nearest neighbors with range constraint of the query object in the network. For solving this problem, the uncertain object is modeled as the fuzzy object and the network -distance between fuzzy objects in the network is defined. Base on them, the concept of constrained k nearest neighbor query for fuzzy object in the network is put forward, and according to the query sequence two query algorithms are proposed. One is by using minimum and maximum -distance between fuzzy object and range constraint to reduce the search area. The other is by using that Euclidean distance can be computed easily and it is the lower bound of the network distance to decline the complexity. Experimental results show that two algorithms have different performance in different condition.
منابع مشابه
Non-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملCredible Nearest Neighbor Query in Uncertain Network
K-nearest-neighbor query is an important query in uncertain network, which is finding the k close nodes to a specific node. We first put forward the concept of the credible nearest neighbor query in uncertain network, and give credible k-nearest-neighbor query algorithm. Credible distance is used to describe the distance between nodes in uncertain network. Fuzzy simulation is adopted to decreas...
متن کاملEfficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data
Given a query object q, a reverse nearest neighbor (RNN) query in a common certain database returns the objects having q as their nearest neighbor. A new challenge for databases is dealing with uncertain objects. In this paper we consider probabilistic reverse nearest neighbor (PRNN) queries, which return the uncertain objects having the query object as nearest neighbor with a sufficiently high...
متن کاملMultiple k Nearest Neighbor Query Processing in Spatial Network Databases
This paper concerns the efficient processing of multiple k nearest neighbor queries in a road-network setting. The assumed setting covers a range of scenarios such as the one where a large population of mobile service users that are constrained to a road network issue nearest-neighbor queries for points of interest that are accessible via the road network. Given multiple k nearest neighbor quer...
متن کاملReverse-Nearest Neighbor Queries on Uncertain Moving Object Trajectories
Reverse nearest neighbor (RNN) queries in spatial and spatio-temporal databases have received significant attention in the database research community over the last decade. A reverse nearest neighbor (RNN) query finds the objects having a given query object as its nearest neighbor. RNN queries find applications in data mining, marketing analysis, and decision making. Most previous research on R...
متن کامل